Closed form summation of $C$-finite sequences
نویسندگان
چکیده
منابع مشابه
Closed form summation of C-finite sequences
in which each {Fi(n)} is a sequence that satisfies a linear recurrence of degree D(i) < ∞, with constant coefficients. We assume further that the ai’s and the ai + bi’s are all nonnegative integers. We prove that such a sum always has a closed form, in the sense that it evaluates to a linear combination of a finite set of monomials in the values of the sequences {Fi(n)} with coefficients that a...
متن کامل2 9 M ay 2 00 4 Closed form summation of C - finite sequences ∗
Suppose {F (n)} is a sequence that satisfies a recurrence with constant coefficients whose associated polynomial equation has distinct roots. Consider a sum of the form n−1 ∑ j=0 (F (a1n + b1j + c1)F (a2n + b2j + c2) . . . F (akn + bkj + ck)). We prove that such a sum always has a closed form in the sense that it evaluates to a polynomial with a fixed number of terms, in the values of the seque...
متن کاملClosed-form summation of two families of finite tangent sums
In our recent paper with Srivastava [D. Cvijović, H.M. Srivastava, Summation of a family of finite secant sums, Appl. Math. Comput. 190 (2007) 590–598] a remarkably general family of the finite secant sums was summed in closed form by choosing a particularly convenient integration contour and making use of the calculus of residues. In this sequel, we show that this procedure can be extended and...
متن کاملConstant term evaluation for summation of C-finite sequences
Based on constant term evaluation, we present a new method to compute a closed form of the summation ∑n−1 k=0 ∏r j=1 Fj(ajn+bjk+cj), where {Fj(k)} are C-finite sequences and aj and aj+bj are nonnegative integers. Our algorithm is much faster than that of Greene and Wilf. Résumé. En s’appuyant sur l’évaluation de termes constants, nous présentons une nouvelle méthode pour calculer une forme clos...
متن کاملClosed-form Summation of Some Trigonometric Series
The problem of numerical evaluation of the classical trigonometric series ^ sin(2fr+ l)a . ^ cOS(2/c + l)a ¿„(a) = > ——;-—— ana C„(a) = > —rr-,-t;—» £j (2k+1)" ÍTo Vk+XY where v > 1 in the case of Sin(a) and C2„+X(a) with n = 1, 2, 3, ... has been recently addressed by Dempsey, Liu, and Dempsey; Boersma and Dempsey; and by Gautschi. We show that, when a is equal to a rational multiple of 2k , t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2006
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-06-03994-8